The Logic of Brouwer and Heyting

نویسنده

  • Joan Rand Moschovakis
چکیده

Intuitionistic logic consists of the principles of reasoning which were used informally by L. E. J. Brouwer, formalized by A. Heyting (also partially by V. Glivenko), interpreted by A. Kolmogorov, and studied by G. Gentzen and K. Gödel during the first third of the twentieth century. Formally, intuitionistic first-order predicate logic is a proper subsystem of classical logic, obtained by replacing the law of excluded middle A ∨ ¬A by ¬A ⊃ (A ⊃ B); it has infinitely many distinct consistent axiomatic extensions, each necessarily contained in classical logic (which is axiomatically complete). However, intuitionistic second-order logic is inconsistent with classical second-order logic. In terms of expressibility, the intuitionistic logic and language are richer than the classical; as Gödel and Gentzen showed, classical first-order arithmetic can be faithfully translated into the negative fragment of intuitionistic arithmetic, establishing proof-theoretical equivalence and clarifying the distinction between the classical and constructive consequences of mathematical axioms. The logic of Brouwer and Heyting is effective. The conclusion of an intuitionistic derivation holds with the same degree of constructivity as the premises. Any proof of a disjunction of two statements can be effectively transformed into a proof of one of the disjuncts, while any proof of an existential statement contains an effective prescription for finding a witness. The negation of a statement is interpreted as asserting that the statement is not merely false but absurd, i.e., leads to a contradiction. Brouwer objected to the general law of excluded middle as claiming a priori that every mathematical problem has a solution, and to the general law ¬¬A ⊃ A of double negation as asserting that every consistent mathematical statement holds. Brouwer called “the First Act of Intuitionism” the separation of mathematics (an exclusively mental activity) from language. For him, all mathematical objects (including proofs) were mental constructions carried out by individual mathematicians. This insight together with “the intuition of the bare two-oneness” guided the creation of intuitionistic logic and arithmetic, with full induction and a theory of the rational numbers. It was limited, by Brouwer’s early insistence on predicative definability, to the construction of entities which were finitely specifiable and thus at most denumerably infinite in number; this seemed to exclude the possibility of a good intuitionistic theory of the continuum. A later insight led Brouwer to “the Second Act of Intuitionism,” which accepted infinitely proceeding sequences of independent choices of objects already constructed (choice sequences of natural numbers, for example) as legitimate mathematical entities. He succeeded in extracting positive information about the structure of the continuum from the fact that an individual choice sequence may be known only by its finite approximations. His “Bar Theorem” (actually a new mathematical axiom) essentially accepted induction up to any denumerable ordinal, significantly extending the intuitionistically available part of classical arithmetic and analysis. His Continuity Principle, which contradicted classical logic (but not classical first-order arithmetic), made possible the development of a rich al-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proofs, Disproofs, and Their Duals

Bi-intuitionistic logic, also known as Heyting-Brouwer logic or subtractive logic, is extended in various ways by a strong negation connective used to express commitments arising from denials. These logics have been introduced and investigated in [48]. In the present paper, an inferentialist semantics in terms of proofs, disproofs, and their duals is developed. Whereas the Brouwer-Heyting-Kolmo...

متن کامل

Heyting-Brouwer Rough Set Logic

A rough set logic based on Heyting-Brouwer algebras HBRSL is proposed as a basis for reasoning about rough information. It is an extension of Düntsch’s logic with intuitionistic implication, and is seen as a variant of HeytingBrouwer logic. A Kripke semantics and natural deduction for the logic are presented and the completeness theorem is proved.

متن کامل

Semantics of intuitionistic propositional logic

Intuitionistic logic is a weakening of classical logic by omitting, most prominently, the principle of excluded middle and the reductio ad absurdum rule. As a consequence, this logic has a wider range of semantical interpretations. The motivating semantics is the so called Brouwer-Heyting-Kolmogorov interpretation of logic. The propositions A,B,C, . . . are regarded as problems or tasks to be s...

متن کامل

On Logics with Coimplication

This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We rst develop matrix as well as Kripke style semantics for those logics. Then, by extending the Godel-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting...

متن کامل

From constructivism to computer science 1

Preamble My ÿeld is mathematical logic, with a special interest in constructivism, and I would not dare to call myself a computer scientist. But some computer scientists regard my work as a contribution to their ÿeld; and in this text I shall try to explain how this is possible, by taking a look at the history of ideas. I want to describe how two interrelated ideas, connected with the construct...

متن کامل

Study of Behaviours via Visitable Paths

Ludics is a logical theory that J.-Y. Girard developed around 2000. At first glance, it may be considered as a Brouwer-Heyting-Kolmogorov interpretation of Logic as a formula is denoted by the set of its proofs. More primitively, Ludics is a theory of interaction that models (a variant of) second-order multiplicative-additive Linear Logic. A formula is denoted by a set of objects called a behav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009